Recognizing Top-Monotonic Preference Profiles in Polynomial Time
نویسندگان
چکیده
We provide the first polynomial-time algorithm for recognizing if a profile of (possibly weak) preference orders is top-monotonic. Top-monotonicity is a generalization of the notions of single-peakedness and single-crossingness, defined by Barberà and Moreno. Top-monotonic profiles always have weak Condorcet winners and satisfy a variant of the median voter theorem. Our algorithm proceeds by reducing the recognition problem to the SAT-2CNF problem.
منابع مشابه
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees
The domain of single crossing preference profiles is a widely studied domain in social choice theory. It has been generalized to the domain of single crossing preference profiles with respect to trees which inherits many desirable properties from the single crossing domain, for example, transitivity of majority relation, existence of polynomial time algorithms for finding winners of Kemeny voti...
متن کاملIsotonic Change Point Estimation in the AR(1) Autocorrelated Simple Linear Profiles
Sometimes the relationship between dependent and explanatory variable(s) known as profile is monitored. Simple linear profiles among the other types of profiles have been more considered due to their applications especially in calibration. There are some studies on the monitoring them when the observations within each profile are autocorrelated. On the other hand, estimating the change point le...
متن کاملThe Complexity of Recognizing Incomplete Single-Crossing Preferences
We study the complexity of deciding if a given profile of incomplete votes (i.e., a profile of partial orders over a given set of alternatives) can be extended to a singlecrossing profile of complete votes (total orders). This problem models settings where we have partial knowledge regarding voters’ preferences and we would like to understand whether the given preference profile may be single-c...
متن کاملSOFIA: How to Make FCA Polynomial?
In pattern mining, one of the most important problems is fighting exponential explosion of the set of patterns. A typical solution is generating only a part of all patterns satisfying some criteria. The most well-known criterion is support of a pattern, which has the monotonicity property allowing one to generate only frequent (highly supported) patterns. Many other useful criteria are not mono...
متن کاملIncomplete Preferences in Single-Peaked Electorates
Incomplete preferences are likely to arise in realworld preference aggregation and voting systems. This paper deals with determining whether an incomplete preference profile is single-peaked. This is essential information since many intractable voting problems become tractable for single-peaked profiles. We prove that for incomplete profiles the problem of determining single-peakedness is NPcom...
متن کامل